Minimal Proper Non-IRUP Instances of the One-Dimensional Cutting Stock Problem
نویسندگان
چکیده
منابع مشابه
Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
We consider the well-known one-dimensional cutting stock problem (1CSP). It is shown that all possible instances of the 1CSP can be divided into a finite number of equivalence classes when the number of items m is fixed. A method for enumerating all these classes is investigated. This method is improved for searching proper non-IRUP instances with minimal number of items. We found the minimal n...
متن کاملFamilies of Non-irup Instances of the One-dimensional Cutting Stock Problem Families of Non-irup Instances of the One-dimensional Cutting Stock Problem
In case of the one-dimensional cutting stock problem (CSP) one can observe for any instance a very small gap between the integer optimal value and the continuous relaxation bound. These observations have initiated a series of investigations. An instance possesses the integer roundup property (IRUP) if its gap is smaller than 1. It is well-known that there exist instances of the CSP having a gap...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملan aco algorithm for one-dimensional cutting stock problem
the one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. in this paper a meta-heuristic method based on aco is presented to solve this problem. in this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملChoice of Method for General One-Dimensional Cutting Stock Problem
Problems in operations research are often NP complete and optimal solution for larger problems cannot be obtained, therefore heuristic methods have to be used. The boundary between the size of the problem that can be solved optimally and those where heuristic methods should be used is not always clear. To solve this problem we propose a method based on decision trees. The method can be also use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2014
ISSN: 1556-5068
DOI: 10.2139/ssrn.2440742